Global Routing for Lookup-Table Based FPGAs Using Genetic Algorithms
نویسندگان
چکیده
In this paper we present experiments concerning the feasibility of using genetic algorithms to efficiently build the global routing in lookup-table based FPGAs. The algorithm is divided in two steps: first, a set of viable routing alternatives is pre-computed for each net, and then the genetic algorithm selects the best routing for each one of the nets that offers the best overall global routing. Our results are comparable to other available global routers, so we conclude that genetic algorithms can be used to build competitive global routing tools.
منابع مشابه
A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA simultaneous placement and global routing algorithm with path length constraints for transport-processing FPGAs
| In layout design of transport-processing FPGAs, it is required that not only routing congestion is kept small but also circuits implemented on them operate with higher operation frequency. This paper extends the proposed simultaneous placement and global routing algorithm for transport-processing FPGAs whose objective is to minimize routing congestion and proposes a new algorithm in which the...
متن کاملAdjusted Weight-Balanced Binary Tree for IP Routing Table Lookup*
Abstract Various algorithms have recently been proposed for Internet routers to improve the performance of routing table lookup. However, most of previous research effort does not utilize the access frequencies of route entries. Since Internet traffic has significant temporal localities [9]-[11], one could largely improve the performance of routing table lookup by taking advantage of access fre...
متن کاملReconfigurable Computing I: Motivation and Concepts
This lecture introduces reconfigurable computing and the field-programmable gate array (FPGA) by discussing the density advantage of configurable computing and some of the trade offs involved in designing and FPGA. Some important conclusions were that wiring and routing area dominate total area, three and four input lookup tables are ideal for area efficiency, five and six input lookup tables a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003